|
In numerical analysis, the Shanks transformation is a non-linear series acceleration method to increase the rate of convergence of a sequence. This method is named after Daniel Shanks, who rediscovered this sequence transformation in 1955. It was first derived and published by R. Schmidt in 1941.〔Weniger (2003).〕 ==Formulation== For a sequence is to be determined. First, the partial sum is defined as: : and forms a new sequence and forms a new sequence. The sequence often converges more rapidly than the sequence Further speed-up may be obtained by repeated use of the Shanks transformation, by computing etc. Note that the non-linear transformation as used in the Shanks transformation is essentially the same as used in Aitken's delta-squared process. Both operate on a sequence, but the sequence the Shanks transformation operates on is usually thought of as being a sequence of partial sums, although any sequence may be viewed as a sequence of partial sums. 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Shanks transformation」の詳細全文を読む スポンサード リンク
|